Inferring Pedigree Graphs from Genetic Distances
نویسندگان
چکیده
منابع مشابه
Inferring Pedigree Graphs from Genetic Distances
In this paper, we study a problem of inferring blood relationships which satisfy a given matrix of genetic distances between all pairs of n nodes. Blood relationships are represented by our proposed graph class, which is called a pedigree graph. A pedigree graph is a directed acyclic graph in which the maximum indegree is at most two. We show that the number of pedigree graphs which satisfy the...
متن کاملInferring purging from pedigree data.
The harmful effects of inbreeding can be reduced if deleterious recessive alleles were removed (purged) by selection against homozygotes in earlier generations. If only a few generations are involved, purging is due almost entirely to recessive alleles that reduce fitness to near zero. In this case the amount of purging and allele frequency change can be inferred approximately from pedigree dat...
متن کاملComparing Pedigree Graphs
Pedigree graphs, or family trees, are typically constructed by an expensive process of examining genealogical records to determine which pairs of individuals are parent and child. New methods to automate this process take as input genetic data from a set of extant individuals and reconstruct ancestral individuals. There is a great need to evaluate the quality of these methods by comparing the e...
متن کاملGenealogical trees from genetic distances
Abstract In a population with haploid reproduction any individual has a single parent in the previous generation. If all genealogical distances among pairs of individuals (generations from the closest common ancestor) are known it is possible to exactly reconstruct their genealogical tree. Unfortunately, in most cases, genealogical distances are unknown and only genetic distances are available....
متن کاملInferring Strings from Graphs and Arrays
This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w such that the directed acyclic subsequence graph (DASG) of w is isomorphic to a given graph G. Secondly, we consider directed acyclic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.2.162